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 03:14Josu San MartinJosu San MartinScore: 4,683Success
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 03:144,61056,828,30737,145,0001,121,0002,469,888
2May 10, 2026 03:144,63454,426,09537,369,0001,098,0002,465,792
3May 10, 2026 03:144,64656,710,00637,365,0001,199,0002,465,792
4May 10, 2026 03:144,66554,281,84737,512,0001,215,0002,473,984
5May 10, 2026 03:144,68354,213,10437,706,0001,169,0002,461,696
6May 10, 2026 03:144,71453,042,20337,925,0001,203,0002,453,504
7May 10, 2026 03:144,76358,004,52038,466,0001,075,0002,461,696
8May 10, 2026 03:144,76655,151,04838,368,0001,190,0002,457,600
9May 10, 2026 03:144,88658,479,76539,370,0001,192,0002,469,888