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 listMay 20, 2026 06:32M-RochatM-RochatScore: 61,280Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 06:3561,221517,428,737433,584,00074,552,0002,129,920
2May 20, 2026 06:3561,224517,373,781433,654,00074,511,0002,129,920
3May 20, 2026 06:3561,277519,381,861433,744,00074,859,0002,129,920
4May 20, 2026 06:3561,279522,023,084433,818,00074,802,0002,129,920
5May 20, 2026 06:3561,280517,779,585434,033,00074,598,0002,129,920
6May 20, 2026 06:3561,340518,905,467433,930,00075,198,0002,129,920
7May 20, 2026 06:3562,368526,800,834435,818,00081,842,0002,129,920
8May 20, 2026 06:3562,633529,053,198436,260,00083,596,0002,129,920
9May 20, 2026 06:3562,694529,592,634436,619,00083,746,0002,129,920