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 21, 2025 21:47Gerard SmitGerard SmitScore: 116,053Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 21, 2025 21:47115,100983,167,128953,332,0001,998,0002,314,240
2Jan 21, 2025 21:47116,053990,336,150962,238,0001,000,0002,293,760
3Jan 21, 2025 21:47119,0081,012,940,713985,771,0001,999,0002,392,064