Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listAug 19, 2025 21:17Adam FolwarcznyAdam FolwarcznyScore: 34,592Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2025 21:1734,585310,618,262285,052,0002,000,0002,383,872
2Aug 19, 2025 21:1734,589310,434,630286,086,0001,000,0002,260,992
3Aug 19, 2025 21:1734,590314,806,535286,100,0001,000,0002,379,776
4Aug 19, 2025 21:1734,591315,636,007286,102,0001,000,0002,506,752
5Aug 19, 2025 21:1734,592315,733,193286,114,0001,000,0002,392,064
6Aug 19, 2025 21:1734,596311,245,145285,146,0002,001,0002,383,872
7Aug 19, 2025 21:1734,598307,887,139287,167,00002,383,872
8Aug 19, 2025 21:1735,907324,296,512296,032,0002,000,0002,387,968
9Aug 19, 2025 21:1735,913329,462,553297,074,0001,000,0002,383,872