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 17, 2026 01:53M-RochatM-RochatScore: 18,869Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 01:5418,843165,551,159155,279,0001,119,0002,113,536
2May 17, 2026 01:5418,849167,865,859155,339,0001,109,0002,113,536
3May 17, 2026 01:5418,855165,250,667155,391,0001,108,0002,113,536
4May 17, 2026 01:5418,865165,719,959155,501,0001,086,0002,113,536
5May 17, 2026 01:5418,869165,441,254155,492,0001,127,0002,113,536
6May 17, 2026 01:5418,874165,513,864155,533,0001,128,0002,113,536
7May 17, 2026 01:5418,890166,098,864155,674,0001,121,0002,113,536
8May 17, 2026 01:5418,896166,831,698155,719,0001,122,0002,113,536
9May 17, 2026 01:5418,935166,018,614155,947,0001,214,0002,113,536