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 18, 2026 18:42wnwnScore: 4,329Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 18:414,28663,319,89734,556,0001,016,0002,490,368
2Mar 18, 2026 18:424,29462,733,78334,622,0001,018,0002,486,272
3Mar 18, 2026 18:414,31860,508,81033,847,0001,991,0002,486,272
4Mar 18, 2026 18:424,32961,927,48733,938,0001,996,0002,482,176
5Mar 18, 2026 18:424,34757,360,93034,078,0002,004,0002,490,368
6Mar 18, 2026 18:414,75058,073,67338,417,0001,010,0002,273,280