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 19, 2026 04:11wnwnScore: 4,405Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2026 04:104,32559,819,08933,905,0001,994,0002,486,272
2Apr 19, 2026 04:114,35560,146,61134,139,0002,008,0002,531,328
3Apr 19, 2026 04:104,38057,333,83635,342,0001,009,0002,531,328
4Apr 19, 2026 04:104,40559,507,14235,544,0001,015,0002,490,368
5Apr 19, 2026 04:114,43970,649,76234,850,0001,991,0002,490,368
6Apr 19, 2026 04:114,51563,452,25236,462,0001,012,0002,494,464