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 26, 2026 03:03zielajzielajScore: 3,454Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 03:033,38348,931,21826,075,0002,005,0002,433,024
2Apr 26, 2026 03:033,38844,331,50327,122,0001,004,0002,310,144
3Apr 26, 2026 03:033,40048,884,67327,218,0001,008,0002,420,736
4Apr 26, 2026 03:033,45243,748,72727,630,0001,023,0002,420,736
5Apr 26, 2026 03:033,45446,359,39127,649,0001,024,0002,420,736
6Apr 26, 2026 03:033,47148,320,54727,782,0001,028,0002,322,432
7Apr 26, 2026 03:033,47944,046,52726,890,0001,991,0002,420,736
8Apr 26, 2026 03:033,50842,006,10228,119,0001,004,0002,322,432
9Apr 26, 2026 03:033,59646,387,16628,824,0001,029,0002,416,640