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 01:19Josu San MartinJosu San MartinScore: 4,954Success
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 01:204,88054,366,00139,316,0001,190,0002,465,792
2May 10, 2026 01:204,88155,825,21239,440,0001,075,0002,473,984
3May 10, 2026 01:204,92456,915,06939,689,0001,182,0002,473,984
4May 10, 2026 01:204,93453,173,63039,888,0001,070,0002,473,984
5May 10, 2026 01:204,95458,505,10640,046,0001,079,0002,478,080
6May 10, 2026 01:205,02355,862,87040,523,0001,168,0002,465,792
7May 10, 2026 01:205,07154,970,93040,985,0001,106,0002,457,600
8May 10, 2026 01:205,07856,206,89540,955,0001,195,0002,478,080
9May 10, 2026 01:205,10857,702,89341,221,0001,180,0002,478,080