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 21, 2026 18:47Daniel MastalerzDaniel MastalerzScore: 5,726Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2026 18:475,64077,218,24343,821,0002,987,0002,314,240
2Feb 21, 2026 18:475,64176,427,87042,833,0003,984,0002,326,528
3Feb 21, 2026 18:475,71574,405,62744,408,0003,027,0002,322,432
4Feb 21, 2026 18:475,72670,051,73645,507,0002,022,0002,318,336
5Feb 21, 2026 18:475,76272,590,92444,770,0003,052,0002,318,336
6Feb 21, 2026 18:475,77469,525,68843,934,0003,994,0002,265,088