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 listFeb 27, 2026 13:35Genos0Genos0Score: 71,307Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 27, 2026 13:3571,227616,590,024537,171,00054,017,0002,281,472
2Feb 27, 2026 13:3571,242616,653,001533,279,00058,030,0002,392,064
3Feb 27, 2026 13:3571,271618,240,095530,594,00060,953,0002,392,064
4Feb 27, 2026 13:3571,279620,086,665530,657,00060,960,0002,281,472
5Feb 27, 2026 13:3571,307618,509,970535,859,00055,985,0002,281,472
6Feb 27, 2026 13:3571,338614,085,999533,096,00059,010,0002,293,760
7Feb 27, 2026 13:3571,392618,047,740528,603,00063,951,0002,281,472
8Feb 27, 2026 13:3571,409622,411,826532,724,00059,969,0002,289,664
9Feb 27, 2026 13:3571,419620,797,708532,803,00059,977,0002,383,872