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 listSep 5, 2026 12:55wnwnScore: 3,338Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 12:593,31235,707,88626,452,0001,038,0002,113,536
2Sep 5, 2026 12:593,32336,027,76526,537,0001,045,0002,113,536
3Sep 5, 2026 12:593,33235,881,14826,642,0001,015,0002,113,536
4Sep 5, 2026 12:593,33536,193,26026,656,0001,031,0002,113,536
5Sep 5, 2026 12:593,33836,150,51026,706,0001,002,0002,113,536
6Sep 5, 2026 12:593,34436,180,60526,757,0001,005,0002,113,536
7Sep 5, 2026 12:593,34937,224,21826,759,0001,039,0002,113,536
8Sep 5, 2026 12:593,49237,400,34927,947,0001,041,0002,113,536
9Sep 5, 2026 12:593,53040,241,41528,295,0001,005,0002,113,536