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 listAug 27, 2026 13:21Victor MerckléVictor MerckléScore: 7,871Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 13:217,83073,363,43563,937,0001,056,0002,113,536
2Aug 27, 2026 13:217,85573,607,28964,146,0001,055,0002,113,536
3Aug 27, 2026 13:217,86073,633,08564,176,0001,069,0002,113,536
4Aug 27, 2026 13:217,86773,699,13864,233,0001,069,0002,113,536
5Aug 27, 2026 13:217,87173,775,42064,294,0001,038,0002,113,536
6Aug 27, 2026 13:217,87174,315,40764,265,0001,070,0002,113,536
7Aug 27, 2026 13:217,87474,453,03664,301,0001,056,0002,113,536
8Aug 27, 2026 13:217,87473,758,43064,299,0001,063,0002,113,536
9Aug 27, 2026 13:218,24876,856,67367,451,0001,010,0002,113,536