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 listMay 10, 2026 08:55Josu San MartinJosu San MartinScore: 4,101Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 08:554,08647,237,66632,874,0001,046,0002,486,272
2May 10, 2026 08:554,09047,608,54732,762,0001,186,0002,490,368
3May 10, 2026 08:554,09347,453,93532,940,0001,034,0002,469,888
4May 10, 2026 08:554,10054,430,93232,982,0001,056,0002,482,176
5May 10, 2026 08:554,10150,033,32632,998,0001,043,0002,486,272
6May 10, 2026 08:554,10352,209,58032,999,0001,062,0002,490,368
7May 10, 2026 08:554,10650,074,96433,044,0001,037,0002,486,272
8May 10, 2026 08:554,12447,880,68433,193,0001,041,0002,486,272
9May 10, 2026 08:554,28352,170,97933,337,0002,220,0002,486,272