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 listDec 29, 2025 14:33Josu San MartinJosu San MartinScore: 29,483Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2025 14:3329,386265,893,830241,906,0001,999,0002,273,280
2Dec 29, 2025 14:3329,393268,685,781241,959,0001,999,0002,273,280
3Dec 29, 2025 14:3329,431265,940,170244,279,00002,281,472
4Dec 29, 2025 14:3329,480270,493,026243,683,000998,0002,273,280
5Dec 29, 2025 14:3329,483272,611,322242,709,0001,997,0002,273,280
6Dec 29, 2025 14:3329,485272,157,596242,729,0001,997,0002,392,064
7Dec 29, 2025 14:3329,496269,883,374243,817,000999,0002,396,160
8Dec 29, 2025 14:3329,499272,050,571243,843,000999,0002,273,280
9Dec 29, 2025 14:3329,506267,129,210243,900,000999,0002,273,280