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 29, 2026 20:02truepogtruepogScore: 521,107Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 29, 2026 20:02520,4584,346,534,3684,239,844,00079,959,0002,289,664
2Jan 29, 2026 20:02520,4954,349,384,8814,237,164,00082,944,0002,281,472
3Jan 29, 2026 20:02520,6324,350,039,9734,239,301,00081,947,0002,289,664
4Jan 29, 2026 20:02521,0624,352,930,1434,256,853,00067,965,0002,281,472
5Jan 29, 2026 20:02521,1074,354,762,7434,264,229,00060,960,0002,523,136
6Jan 29, 2026 20:02521,1364,349,790,1494,252,475,00072,956,0002,265,088
7Jan 29, 2026 20:02521,2694,358,904,4154,274,565,00051,970,0002,281,472
8Jan 29, 2026 20:02521,5664,355,848,4784,263,028,00065,969,0002,293,760
9Jan 29, 2026 20:02529,5834,422,099,5754,327,564,00067,977,0002,523,136