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 listJul 17, 2026 16:02Kevin HeaveyKevin HeaveyScore: 3,798Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 17, 2026 16:033,60939,846,93628,912,0001,046,0002,117,632
2Jul 17, 2026 16:033,64940,078,99929,247,0001,047,0002,117,632
3Jul 17, 2026 16:033,66051,224,82229,343,0001,042,0002,117,632
4Jul 17, 2026 16:033,68040,261,99229,502,0001,045,0002,117,632
5Jul 17, 2026 16:033,79841,302,18730,487,0001,042,0002,117,632
6Jul 17, 2026 16:033,82941,553,73130,569,0001,212,0002,117,632
7Jul 17, 2026 16:033,85542,092,17430,949,0001,050,0002,117,632
8Jul 17, 2026 16:033,89842,086,96231,310,0001,044,0002,117,632
9Jul 17, 2026 16:033,93542,538,81031,438,0001,230,0002,117,632