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 17, 2026 19:36Victor MerckléVictor MerckléScore: 6,989Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 19:376,96167,642,88956,698,0001,085,0002,113,536
2May 17, 2026 19:376,96665,591,67956,752,0001,074,0002,113,536
3May 17, 2026 19:376,96768,047,75856,772,0001,056,0002,113,536
4May 17, 2026 19:376,97467,351,84356,831,0001,057,0002,113,536
5May 17, 2026 19:376,98967,562,42356,963,0001,048,0002,113,536
6May 17, 2026 19:377,02066,032,92457,221,0001,047,0002,113,536
7May 17, 2026 19:377,02466,432,31757,252,0001,049,0002,113,536
8May 17, 2026 19:377,03766,076,73157,353,0001,057,0002,113,536
9May 17, 2026 19:377,19869,818,58558,686,0001,060,0002,113,536