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 listMar 15, 2026 20:40wnwnScore: 26,958Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 20:4026,939248,860,212222,588,0001,002,0002,273,280
2Mar 15, 2026 20:4026,958247,278,206221,755,0001,997,0002,273,280
3Mar 15, 2026 20:4027,028242,553,442223,329,0001,001,0002,494,464