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 24, 2026 04:05wnwnScore: 4,293Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 04:073,57138,393,29727,922,0001,723,0002,113,536
2Sep 24, 2026 04:073,64339,206,04228,439,0001,798,00020,480
3Sep 24, 2026 04:074,18343,523,35327,230,0007,493,0002,113,536
4Sep 24, 2026 04:074,26744,157,46128,152,0007,269,0002,113,536
5Sep 24, 2026 04:074,29345,060,61128,274,0007,365,0002,113,536
6Sep 24, 2026 04:075,01150,354,85227,597,00014,001,0002,113,536
7Sep 24, 2026 04:075,03052,562,33928,339,00013,411,0002,113,536
8Sep 24, 2026 04:075,14352,908,83327,627,00015,062,0002,113,536
9Sep 24, 2026 04:075,18051,733,25228,970,00014,025,0002,113,536