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 18, 2026 18:53Daniel MastalerzDaniel MastalerzScore: 6,434Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 18:535,96372,109,92943,436,0006,060,0002,318,336
2Feb 18, 2026 18:536,04377,753,04842,136,0008,025,0002,408,448
3Feb 18, 2026 18:536,06277,217,43044,278,0006,037,0002,404,352
4Feb 18, 2026 18:536,43479,033,68044,333,0009,068,0002,314,240
5Feb 18, 2026 18:536,48379,563,29246,836,0006,975,0002,392,064
6Feb 18, 2026 18:536,52883,163,67848,166,0006,020,0002,326,528