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 listJan 25, 2025 15:15bendnbendnScore: 812,611Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 25, 2025 15:15812,5626,775,744,1036,742,264,0001,998,0002,543,616
2Jan 25, 2025 15:15812,6116,771,145,3556,742,673,0001,999,0002,527,232
3Jan 25, 2025 15:15812,7836,777,270,9896,740,101,0005,996,0002,273,280