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 15, 2026 22:31wnwnScore: 9,667Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 22:318,46893,360,49263,253,0007,028,0002,457,600
2Feb 15, 2026 22:318,48894,533,16062,400,0008,051,0002,457,600
3Feb 15, 2026 22:318,52997,300,44664,805,0005,982,0002,465,792
4Feb 15, 2026 22:319,667107,968,17772,216,0008,024,0002,453,504
5Feb 15, 2026 22:319,763116,792,99772,033,0009,004,0002,281,472
6Feb 15, 2026 22:319,921106,933,94275,313,0007,029,0002,523,136