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 05:15Josu San MartinJosu San MartinError
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 05:15052,509,79633,418,0001,044,0002,473,984expected "53693348339676512 ", got "53693348238928061 "
2May 10, 2026 05:154,12250,755,13833,106,0001,113,0002,482,176
3May 10, 2026 05:154,14048,537,74933,267,0001,096,0002,482,176
4May 10, 2026 05:154,15348,499,01533,306,0001,164,0002,478,080
5May 10, 2026 05:154,15849,473,05433,460,0001,057,0002,486,272
6May 10, 2026 05:154,16050,307,37433,409,0001,122,0002,482,176
7May 10, 2026 05:154,16953,030,05133,547,0001,058,0002,478,080
8May 10, 2026 05:154,17150,299,65233,445,0001,182,0002,490,368
9May 10, 2026 05:154,17652,223,62733,596,0001,072,0002,482,176