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 19, 2025 14:55KeefeKeefeScore: 62,358Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2025 14:5562,140539,675,995513,761,0001,999,0002,445,312
2Apr 19, 2025 14:5562,358541,892,999515,575,0001,998,0002,269,184
3Apr 19, 2025 14:5564,069551,991,495529,773,0001,999,0002,445,312