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 listApr 10, 2026 08:16poyo180605poyo180605Score: 48,875Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 10, 2026 08:1648,820427,834,136349,178,00056,028,0002,289,664
2Apr 10, 2026 08:1648,826425,836,076350,223,00055,035,0002,281,472
3Apr 10, 2026 08:1648,827427,051,776351,233,00054,035,0002,281,472
4Apr 10, 2026 08:1648,841433,436,743349,326,00056,052,0002,289,664
5Apr 10, 2026 08:1648,875429,586,258345,716,00059,950,0002,289,664
6Apr 10, 2026 08:1648,884427,255,724346,776,00058,962,0002,281,472
7Apr 10, 2026 08:1648,929434,082,804347,093,00059,015,0002,510,848
8Apr 10, 2026 08:1648,942436,798,673346,185,00060,032,0002,281,472
9Apr 10, 2026 08:1648,955434,111,634346,278,00060,048,0002,289,664