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 listJul 30, 2025 02:46Marco BarboneMarco BarboneScore: 122,798Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2025 02:46121,0231,030,246,7081,003,488,000999,0002,289,664
2Jul 30, 2025 02:46122,7981,048,440,2761,017,223,0001,998,0002,289,664
3Jul 30, 2025 02:46125,0661,064,341,5341,037,050,0001,000,0002,281,472