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 listFeb 27, 2026 21:03defiancedefianceScore: 99,430Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 27, 2026 21:0399,216846,674,138593,635,000229,858,0002,297,856
2Feb 27, 2026 21:0399,274855,174,868595,261,000228,716,0002,293,760
3Feb 27, 2026 21:0399,357852,014,234592,757,000231,905,0002,289,664
4Feb 27, 2026 21:0399,402851,506,246594,305,000230,730,0002,334,720
5Feb 27, 2026 21:0399,430849,043,118594,476,000230,796,0002,482,176
6Feb 27, 2026 21:0399,435851,838,098594,501,000230,806,0002,392,064
7Feb 27, 2026 21:0399,533851,871,733594,373,000231,755,0002,277,376
8Feb 27, 2026 21:0399,629858,477,161594,225,000232,696,0002,273,280
9Feb 27, 2026 21:0399,701851,490,593594,655,000232,865,0002,289,664