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 listMay 3, 2026 04:51limanjun99limanjun99Score: 5,664Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 04:515,59666,380,06140,394,0006,059,0002,416,640
2May 3, 2026 04:515,61066,908,06739,634,0006,936,0002,424,832
3May 3, 2026 04:515,61861,983,03240,684,0005,953,0002,424,832
4May 3, 2026 04:515,62069,607,16939,699,0006,947,0002,453,504
5May 3, 2026 04:515,66462,169,33042,012,0005,001,0002,428,928
6May 3, 2026 04:515,66664,647,97240,025,0007,004,0002,416,640
7May 3, 2026 04:515,67666,546,27340,095,0007,016,0002,408,448
8May 3, 2026 04:515,67762,095,70341,107,0006,015,0002,314,240
9May 3, 2026 04:515,82371,232,66842,297,0006,042,0002,408,448