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 listJul 28, 2025 02:01Marco BarboneMarco BarboneScore: 63,328Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 28, 2025 02:0162,395541,139,133514,877,0002,999,0002,269,184
2Jul 28, 2025 02:0163,328549,539,574523,622,0001,998,0002,371,584
3Jul 28, 2025 02:0189,221764,394,408738,538,0001,998,0002,273,280