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 13, 2026 21:18Daniel MastalerzDaniel MastalerzScore: 8,505Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 13, 2026 21:188,32191,766,98166,064,0003,002,0002,273,280
2Feb 13, 2026 21:188,33997,148,27867,208,0002,006,0002,527,232
3Feb 13, 2026 21:188,34196,584,63463,212,0006,020,0002,310,144
4Feb 13, 2026 21:188,505106,870,28569,586,0001,008,0002,289,664
5Feb 13, 2026 21:188,50696,673,64966,622,0003,977,0002,256,896
6Feb 13, 2026 21:188,53093,450,72464,813,0005,982,0002,301,952