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 listApr 30, 2026 00:02olliecrowolliecrowScore: 6,301Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 30, 2026 00:026,21462,826,39349,559,0002,022,0002,519,040
2Apr 30, 2026 00:026,23470,647,55146,770,0004,975,0002,338,816
3Apr 30, 2026 00:026,28267,483,88448,134,0004,011,0002,334,720
4Apr 30, 2026 00:026,29971,444,15047,259,0005,027,0002,310,144
5Apr 30, 2026 00:026,30176,193,84948,278,0004,023,0002,527,232
6Apr 30, 2026 00:026,30374,230,01948,292,0004,024,0002,510,848
7Apr 30, 2026 00:026,32567,167,49251,492,0001,009,0002,502,656
8Apr 30, 2026 00:026,37366,672,17446,911,0005,988,0002,310,144
9Apr 30, 2026 00:026,39770,844,81850,097,0003,005,0002,531,328