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 10, 2026 02:16Josu San MartinJosu San MartinScore: 4,667Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 02:164,54251,830,98536,639,0001,065,0002,469,888
2May 10, 2026 02:164,55952,298,37136,781,0001,061,0002,465,792
3May 10, 2026 02:164,62550,956,32237,326,0001,064,0002,478,080
4May 10, 2026 02:164,63155,989,97237,334,0001,109,0002,461,696
5May 10, 2026 02:164,66754,232,00037,558,0001,181,0002,469,888
6May 10, 2026 02:164,68452,994,90937,828,0001,057,0002,469,888
7May 10, 2026 02:164,71953,692,55238,057,0001,114,0002,482,176
8May 10, 2026 02:164,77153,462,38038,524,0001,078,0002,469,888
9May 10, 2026 02:165,03860,001,63740,616,0001,201,0002,478,080