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 17, 2026 10:33Joad NacerJoad NacerScore: 8,412Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 17, 2026 10:338,40994,313,76369,795,00002,506,752
2Apr 17, 2026 10:338,41294,109,30768,821,000997,0002,535,424
3Apr 17, 2026 10:338,41490,671,33468,822,0001,012,0002,535,424