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 06:26Josu San MartinJosu San MartinScore: 4,109Success
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 06:264,09347,129,94732,877,0001,100,0002,490,368
2May 10, 2026 06:264,10250,404,91732,953,0001,096,0002,486,272
3May 10, 2026 06:264,10547,383,65832,882,0001,197,0002,473,984
4May 10, 2026 06:264,10848,078,13832,955,0001,144,0002,482,176
5May 10, 2026 06:264,10948,194,56833,012,0001,097,0002,490,368
6May 10, 2026 06:264,11152,150,11332,986,0001,140,0002,502,656
7May 10, 2026 06:264,11248,261,57832,963,0001,170,0002,486,272
8May 10, 2026 06:264,11849,100,40133,125,0001,059,0002,486,272
9May 10, 2026 06:264,12251,460,87033,061,0001,153,0002,490,368