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 4, 2025 20:00Adam FolwarcznyAdam FolwarcznyScore: 7,902Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2025 20:007,80893,228,55143,870,00020,938,0002,277,376
2Sep 4, 2025 20:007,85486,395,67747,139,00018,053,0002,277,376
3Sep 4, 2025 20:007,87190,802,18346,235,00019,097,0002,523,136
4Sep 4, 2025 20:007,90294,058,97646,414,00019,171,0002,277,376
5Sep 4, 2025 20:007,93387,862,39851,880,00013,967,0002,269,184
6Sep 4, 2025 20:007,93788,464,77747,912,00017,967,0002,314,240