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 listApr 20, 2026 14:32BenBenScore: 38,695Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 14:3238,690347,136,788319,128,0002,000,0002,265,088
2Apr 20, 2026 14:3238,695349,415,177318,171,0003,001,0002,506,752
3Apr 20, 2026 14:3238,741338,459,022320,551,0001,001,0002,277,376