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:20M-RochatM-RochatScore: 37,973Success
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:2037,959326,342,354314,057,0001,004,0002,113,536
2May 20, 2026 06:2037,964324,984,027314,099,0001,003,0002,113,536
3May 20, 2026 06:2037,966326,265,119314,120,0001,004,0002,113,536
4May 20, 2026 06:2037,967324,363,759314,129,0001,005,0002,113,536
5May 20, 2026 06:2037,973324,974,281314,175,0001,005,0002,113,536
6May 20, 2026 06:2037,976324,891,768314,206,0001,003,0002,113,536
7May 20, 2026 06:2038,012339,658,877314,501,0001,004,0002,113,536
8May 20, 2026 06:2038,018332,558,117314,548,0001,004,0002,113,536
9May 20, 2026 06:2038,021340,064,477314,577,0001,003,0002,113,536