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 27, 2025 04:22Serendipity1902Serendipity1902Score: 53,212Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2025 04:2253,207467,811,638439,616,0001,998,0002,531,328
2Jul 27, 2025 04:2253,207467,948,897439,621,0001,998,0002,531,328
3Jul 27, 2025 04:2253,207466,652,347440,623,000999,0002,531,328
4Jul 27, 2025 04:2253,208467,344,529440,627,000999,0002,449,408
5Jul 27, 2025 04:2253,212468,491,760439,663,0001,998,0002,441,216
6Jul 27, 2025 04:2253,215471,455,725439,688,0001,998,0002,531,328
7Jul 27, 2025 04:2253,224469,482,416439,764,0001,998,0002,281,472
8Jul 27, 2025 04:2253,225469,599,931439,773,0001,998,0002,441,216
9Jul 27, 2025 04:2253,227469,708,768439,785,0001,999,0002,269,184